Problem section

PROBLEM SECTION Splitting digraphs

There are several known results asserting that undirected graphs can be partitioned in a way that satisfies various imposed constrains on the degrees. The corresponding results for directed graphs, where degrees are replaced by outdegrees, often fail, and when they do hold, they are usually much harder, and lead to fascinating open problems. In this note we list three problems of this type, and...

Section] Section] Section] Section] Section] Section] Section] Section] Section] 0

Section] Section] Section] Section] Section] Section] Section] Section] Section] Section] 0 Estimating Performance Measures in Stochastic Cyclic Schedules

This paper reviews a cyclic scheduling model of repetitive manufacturing environments consisting of exible machines and multi-stage jobs. We explicitly model two system performance measures, throughput and ow time, while incorporating variability arising from uncertainty in operation processing times. We present an iterative approximation scheme to estimate the two moment behavior of our perfor...

An Investigation of the Course-Section Assignment Problem

We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define the problem formally, and then present an algorithm that systematically enumerates solutions for it. The algorithm uses backtracking to perform a depth-first search of the implicit search space defined by the problem, pruning the s...

Section Ii Medical Aspects of the Addiction Problem,

20. In the course of our inquiry we have received a large amount of valuable information upon the nature, causation, and prognosis of addiction.as well as upon upon the different mehods of treatment which have been advocated from to time, In asmuch as such informationhas not heretofore been available in so easily accessible a form, and as there has not previously been so favourable an opportuni...